Network Synthesis with Non-simultaneous Multicommodity Flow Requirements: Bounds and Heuristics

Whenever an edge failure occurs in a telecommunications network, the amount of traac using the faulty edge has to be rerouted on some other paths through the network thus requiring the presence of reserve capacity in the network. This leads to the design of a network of extra capacities suucient to independently reroute the ow on each arc and having minimum cost. This problem is known as a network synthesis problem with non-simultaneous multicommodity ow requirements. Here we propose to use a surrogate duality method based on a model formulation containing several blocks of constraints to compute lower bounds on the linear relaxation of the problem. This bound is then considered as input to a greedy heuristic to nd integer feasible solutions. Finally, a tabu search procedure based on this greedy heuristic is developed and tested on a wide set of problem instances. 1 duality, lower bounds, tabu search.